/**
 * Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. 
 * The algorithm should run in linear time and in O(1) space.
 */
/**
 * @author I321035
 *
 */
package problem229_Majority_Element_II;